A hierarchy for nondeterministic time complexity
نویسندگان
چکیده
منابع مشابه
Almost-Everywhere Complexity Hierarchies for Nondeterministic Time
A preliminary version of this work appeared as [2]. y Supported in part by National Science Foundation grant CCR-9000045. Some of this research was performed while the author was a visiting professor at Institut f ur Informatik, Universit at W urzburg, D-8700 W urzburg, Federal Republic of Germany. z Supported in part by the National Science Foundation grants CCR-8808949 and CCR-8958528. Wo...
متن کاملThe Nondeterministic Complexity of a Finite Automaton
We deene the nondeterministic complexity of a nite automaton and show that there exist, for any integer p 1, automata which need (k 1=p) nondeterministic transitions to spell words of length k. This leads to a subdivision of the family of recognizable M-subsets of a free monoid into a hierarchy whose members are indexed by polynomials, where M denotes the Min{Plus semiring.
متن کاملQuantum Weakly Nondeterministic Communication Complexity
In this paper, we study a weak version of quantum nondeterministic communication complexity, corresponding to the most natural generalization of classical nondeterminism, in which a classical proof has to be checked with probability one by a quantum protocol. Another stronger definition of quantum nondeterminism has already been extensively studied, corresponding to the view of quantum nondeter...
متن کاملA Complexity-Based Hierarchy for Multiprocessor Synchronization
For many years, Herlihy’s elegant computability based Consensus Hierarchy has been our best explanation of the relative power of various types of multiprocessor synchronization objects when used in deterministic algorithms. However, key to this hierarchy is treating synchronization instructions as distinct objects, an approach that is far from the real-world, where multiprocessor programs apply...
متن کاملAn Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We refine the technique to strengthen the result, constructing an oracle relative to which a conjecture of Lipton is false.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1973
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(73)80028-5